Multi-Objective Ant Colony Optimization Algorithm to Solve a Nurse Scheduling Problem

نویسندگان

  • Yassine Saji
  • Mohammed Essaid Riffi
چکیده

In this paper we deal with the Nurse Scheduling Problem (NSP) in a hospital. The problem aims to generate a feasible and a satisfactory schedule to the planners and the hospital staffs. Sometimes a large number of constraints are taken into account: preferences of staffs (vacation, public holidays, and special demands) and administrative or union obligations, in order to ensure a good working condition and consecrate more time to take care of the patients. To solve NSP, we use a multi-objective mathematical programming model, and for the based search method, we propose an adaptation of a Multi-Objective Ant Colony Optimization algorithm (MOACO). MOACO is extensively for solving multi-objective optimization problems, especially combinational ones. To demonstrate the efficiency of our proposed search method towards others algorithms such as genetic algorithm, some numerical tests based on real data from different units of a large hospital are also pre tutored. Keywords— Nurse Scheduling Problem, Meta-heuristic, Multi-objective optimization, Ant Colony Optimization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of an energy based bi-objective multi skilled resource investment project scheduling problem

Growing concern in the management of energy due to the increasing energy costs, has forced managers to optimize the amount of energy required to provide products and services. This research integrates an energy-based resource investment project-scheduling problem (RIP) under a multi-skilled structure of the resources. The proposed energy based multi skilled resource investment problem (EB-MSRIP...

متن کامل

Flow shop Scheduling Problem with Maintenance Coordination: a New Approach

This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...

متن کامل

Multi-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm

In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...

متن کامل

A Performance Study for the Multi-objective Ant Colony Optimization Algorithms on the Job Shop Scheduling Problem

Most of the research on job shop scheduling problem are concerned with minimization of a single objective. However, the real world applications of job shop scheduling problems are involved in optimizing multiple objectives. Therefore, in recent years ant colony optimization algorithms have been proposed to solve job shop scheduling problems with multiple objectives. In this paper, some recent m...

متن کامل

A Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers

Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013